An advanced greedy square jigsaw puzzle solver

نویسنده

  • Dolev Pomeranz
چکیده

The jigsaw puzzle is a well known problem, which many encounter during childhood. Given a set of parts, one needs to reconstruct the original image. This problem is known to be NP-complete. In this paper I describe a greedy solver with several improvements. Before discussing the general idea and improvements, I will discuss some important known metrics that will help us clarify the solver algorithm and the desired result. I will show several new compatibility metrics, and will focus on one that is better than the best known metric. In addition to compatibility metrics, performance metrics and estimation metrics will be explored. I will explain the generic algorithm and the additional modules that can be plugged-in to the algorithm. I will introduce the shifting problem, and a possible solution using a segmentation module. Since one cannot write a solver without some test results, I will present a benchmark of the solver performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Jigsopu: Square Jigsaw Puzzle Solver with Pieces of Unknown Orientation

In this paper, we consider the square jigsaw puzzle problem in which one is required to reassemble the complete image from a number of unordered square puzzle pieces. Here we focus on the special case where both location and orientation of each piece are unknown. We propose a new automatic solver for such problem without assuming prior knowledge about the original image or its dimensions. We us...

متن کامل

A fully automated greedy square jigsaw puzzle solver Supplementary material

Figs. 1-4 shows our solver results for for all 20 images used by Cho et al. [1], where each puzzle consists of 432 patches of 28 × 28 pixels. In addition to the final result, these figures also show the results of the initial placement by the placer, the initial segmentation by the segmenter, and the final result after the shifter. The average performance metrics accuracy results for all 20 ima...

متن کامل

LAJANUGEN LOGESWARAN : SOLVING JIGSAW PUZZLES USING PATHS AND CYCLES 1 Solving Jigsaw Puzzles using Paths and Cycles

There has been a growing interest in image jigsaw puzzles with square shaped pieces. A solver takes as input square shaped patches of the same size belonging to an image and attempts to reconstruct the image. The key components of a jigsaw solver are a compatibility metric and an assembly algorithm. A compatibility metric uses the color content of the image patches to identify which pairs of pi...

متن کامل

Solving Multiple Square Jigsaw Puzzles with Missing Piece

Puzzle solving is important in many applications, such as image editing [1], biology [5] and archaeology, to name a few. This work focuses on puzzles with square pieces. The problem is introduced by [2], where a greedy algorithm, as well as a benchmark, are proposed. The algorithm discussed in [8] improves the results by using a particle filter. Pomeranz et al. [6] introduce the first fully-aut...

متن کامل

Jigsaw Puzzle Solver Using Shape and Color

The jigsaw puzzle assembly problem is significant in that it can be applied to diverse areas such as repair of broken objects , restoration of archaeological findings, molecular docking problem for drug design, etc. This paper describes a new pictorial jigsaw puzzle solver which, in contrast to previous apictorial jigsaw puzzle solvers, uses chromatic information as well as geometric shape. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010